Model-theoretic characterization of intuitionistic predicate formulas
نویسندگان
چکیده
منابع مشابه
Model-Theoretic characterization of intuitionistic Propositional Formulas
Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to k-asimulations for some k, and then that a first-order formula is equivalent to a standard translation of...
متن کاملA Model-Theoretic Counterpart of Loop Formulas
In an important recent paper, Lin and Zhao introduced the concept of a loop formula, and showed that the answer sets for a logic program are exactly the models of Clark’s completion of the program that satisfy the loop formulas. Just as supported sets are a model-theoretic account of completion, “externally supported” sets, defined in this paper, are a model-theoretic counterpart of loop formul...
متن کاملStable formulas in intuitionistic logic
NNIL-formulas are propositional formulas that do not allow nesting of implication to the left. These formulas were introduced in [16], where it was shown that NNIL-formulas are (up to provable equivalence) exactly the formulas that are preserved under taking submodels of Kripke models. In this paper we show that NNIL-formulas are up to frame equivalence the formulas that are preserved under tak...
متن کاملInterpolation theorems for intuitionistic predicate logic
Craig interpolation theorem (which holds for intuitionistic logic) implies that the derivability of X,X’-¿Y’ implies existence of an interpolant I in the common language of X and X’-¿Y’ such that both X-¿I and I,X’-¿Y’ are derivable. For classical logic this extends to X,X’-¿Y,Y’, but for intuitionistic logic there are counterexamples. There is a version true for intuitionistic propositional (b...
متن کاملAutomata Theory Approach to Predicate Intuitionistic Logic
Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We present a model of automata that can handle proof construction in full intuitionistic first-order logic. The automata are constructed in such a way that any ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2013
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/ext014